Welcome to the InfoSci Platform
Reference Hub2
Rough ISODATA Algorithm

Rough ISODATA Algorithm

S. Sampath, B. Ramya
Copyright: © 2013 |Volume: 3 |Issue: 4 |Pages: 14
ISSN: 2156-177X|EISSN: 2156-1761|EISBN13: 9781466635609|DOI: 10.4018/ijfsa.2013100101
Cite Article Cite Article

MLA

Sampath, S., and B. Ramya. "Rough ISODATA Algorithm." IJFSA vol.3, no.4 2013: pp.1-14. http://doi.org/10.4018/ijfsa.2013100101

APA

Sampath, S. & Ramya, B. (2013). Rough ISODATA Algorithm. International Journal of Fuzzy System Applications (IJFSA), 3(4), 1-14. http://doi.org/10.4018/ijfsa.2013100101

Chicago

Sampath, S., and B. Ramya. "Rough ISODATA Algorithm," International Journal of Fuzzy System Applications (IJFSA) 3, no.4: 1-14. http://doi.org/10.4018/ijfsa.2013100101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Cluster analysis is a branch of data mining, which plays a vital role in bringing out hidden information in databases. Clustering algorithms help medical researchers in identifying the presence of natural subgroups in a data set. Different types of clustering algorithms are available in the literature. The most popular among them is k-means clustering. Even though k-means clustering is a popular clustering method widely used, its application requires the knowledge of the number of clusters present in the given data set. Several solutions are available in literature to overcome this limitation. The k-means clustering method creates a disjoint and exhaustive partition of the data set. However, in some situations one can come across objects that belong to more than one cluster. In this paper, a clustering algorithm capable of producing rough clusters automatically without requiring the user to give as input the number of clusters to be produced. The efficiency of the algorithm in detecting the number of clusters present in the data set has been studied with the help of some real life data sets. Further, a nonparametric statistical analysis on the results of the experimental study has been carried out in order to analyze the efficiency of the proposed algorithm in automatic detection of the number of clusters in the data set with the help of rough version of Davies-Bouldin index.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.